Combining Cross-Entropy and MADS Methods for Inequality Constrained Global Optimization

نویسندگان

چکیده

This paper proposes a way to combine the Mesh Adaptive Direct Search (MADS) algorithm with Cross-Entropy (CE) method for nonsmooth constrained optimization. The CE is used as an exploration step by MADS algorithm. result of this combination retains convergence properties and allows efficient in order move away from local minima. samples trial points according multivariate normal distribution whose mean standard deviation are calculated best found so far. Numerical experiments show efficiency compared other global optimization heuristics. Moreover, applied on complex engineering test problems, important improvement reach feasible region escape

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New interval methods for constrained global optimization

Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adaptive multisection rules which enable the algorithm to choose the proper multisection type depending on simple heuristic decision rules. Moreover, for the selection of the next box to be subdivided, we investigate new criteria. ...

متن کامل

Geometric branch-and-bound methods for constrained global optimization problems

Geometric branch-and-bound methods are popular solution algorithms in deterministic global optimization to solve problems in small dimensions. The aim of this paper is to formulate a geometric branch-and-bound method for constrained global optimization problems which allows the use of arbitrary bounding operations. In particular, our main goal is to prove the convergence of the suggested method...

متن کامل

Generalized decomposition and cross entropy methods for many-objective optimization

Decomposition-based algorithms for multi-objective optimization problems have increased in popularity in the past decade. Although their convergence to the Pareto optimal front (PF) is in several instances superior to that of Pareto-based algorithms, the problem of selecting a way to distribute or guide these solutions in a high-dimensional space has not been explored. In this work, we introduc...

متن کامل

Quasi-Newton Methods for Nonconvex Constrained Multiobjective Optimization

Here, a quasi-Newton algorithm for constrained multiobjective optimization is proposed. Under suitable assumptions, global convergence of the algorithm is established.

متن کامل

Ranking the Methods of Technology Cross-Border Acquisition, Combining TOPSIS and ANP Approaches for Model Development

Simultaneous with the industries increasing growth, thecompanies must acquire the new technologies to achieve the core competency,survival and improvement and also effectiveness in market. Choosingthe suitable acquisition mode of required technology is one of thecritical strategic decisions in the field of technology management. Dueto the importance of technology acquisition, the main objective...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research Forum

سال: 2021

ISSN: ['2662-2556']

DOI: https://doi.org/10.1007/s43069-021-00075-y